Constant Fraction Integer Multiplication

ABSTRACT

A binary logic circuit is provided for determining a rounded value of 
     
       
         
           
             
               px 
               q 
             
             , 
           
         
       
     
     where p and q are coprime constant integers with p&lt;q and q≠2 i , i is any integer, and x is an integer variable between 0 and integer M where M≧2q, the binary logic circuit implementing in hardware the optimal solution of the multiply-add operation 
     
       
         
           
             
               ax 
               + 
               b 
             
             
               2 
               k 
             
           
         
       
     
     where a, b and k are fixed integers.

BACKGROUND

This invention relates to a logic circuit for implementing binary multiplication by a constant fraction and to a method of deriving a binary logic circuit for performing such multiplication.

When designing integrated circuits, logic is often required to perform addition, subtraction, multiplication and division. Whilst addition, subtraction and multiplication operations can all be cheaply implemented in hardware, division is acknowledged to be an expensive operation to implement in hardware.

In the case that the divisor is known to be a constant at design-time, a division operation can be expressed as multiplication by a constant fraction and it is possible to construct efficient implementations of the division operation using a combination of addition and constant multiplication logic. This can significantly simplify the logic and hence reduce the area of integrated circuit needed to implement the division operation. For example, if the division operation

$\frac{px}{q},$

where p and q are integer constants and x is an integer variable, can be rewritten in the form

$\frac{{ax} + b}{2^{k}},$

then the division operation can be expressed in logic as a multiply-add operation whose result is right-shifted by k binary places. However, there are an infinite number of values of a, b and k which satisfy this equation, some of which provide less efficient expressions in logic than others.

US Patent Application 2013/0103733, which is incorporated by reference in its entirety, discloses techniques for deriving values for a, b and k for use in designing integrated circuit logic, but does not describe logic optimally configured according to the most efficient expression of multiplication by a constant fraction. Suboptimal expressions of division logic, even those embodied as a multiply-add operation, are overly complex and consume a greater area of integrated circuit than necessary.

BRIEF SUMMARY

According to a first aspect of the disclosure there is provided a binary logic circuit configured to determine a rounded value of

$\frac{px}{q},$

where p and q are coprime constant integers with p<q and q≠2^(i), i is any integer, and x is an integer variable between 0 and integer M where M≧2q, the binary logic circuit being configured to implement the operation:

$\frac{{ax} + b}{2^{k}}$

where a and b are fixed integers and k is the smallest integer that satisfies either:

$\begin{matrix} {{\frac{2^{k}}{\left( {p\; 2^{k}} \right){mod}\mspace{11mu} q} > {{q\left\lfloor \frac{M}{q} \right\rfloor} - q + p^{- 1}}};{or}} & (a) \\ {\frac{2^{k}}{\left( {{- p}\; 2^{k}} \right){mod}\mspace{11mu} q} > {M - \left( {\left( {M + p^{- 1}} \right){mod}\mspace{11mu} q} \right)}} & (b) \end{matrix}$

wherein:

-   -   if (a) is satisfied by a smaller integer k than (b), then a is         an integer given by

$\left\lfloor \frac{p\; 2^{k}}{q} \right\rfloor$

-   -    and b is an integer in the range

$\left\lbrack {{\left\lfloor \frac{M}{q} \right\rfloor \left( {\left( {p\; 2^{k}} \right){mod}\mspace{11mu} q} \right)},{\frac{2^{k} + {\left( {q - p^{- 1}} \right)\left( {\left( {p\; 2^{k}} \right){mod}\mspace{11mu} q} \right)}}{q} - 1}} \right\rbrack;$

and

-   -   if (b) is satisfied by a smaller integer k than (a), then a is         an integer given by

$\left\lceil \frac{p\; 2^{k}}{q} \right\rceil$

-   -    and b is an integer in the range

$\left\lbrack {0,{\frac{2^{k} - {\left( {M - \left( {\left( {M + p^{- 1}} \right){mod}\mspace{11mu} q} \right)} \right)\left( {\left( {{- p}\; 2^{k}} \right){mod}\mspace{14mu} q} \right)}}{q} - 1}} \right\rbrack.$

The binary logic circuit may be a binary multiplier array having a plurality of rows, a first subset of the plurality of rows being configured to perform multiplication by the fixed integer a, a second subset of the plurality of rows being configured to perform the addition of b, and said rounded value being the output of the multiplier array right-shifted by k binary digits.

The first subset of the plurality of rows of the binary multiplier array may be a substantially minimum number of rows required to implement the multiplication of x by fixed integer a.

The second subset of the plurality of rows of the binary multiplier array may be a single row arranged to perform the addition of fixed integer b.

The plurality of rows of the multiplier array may be arranged such that the representations of the integer variable x at those rows are collectively truncated by a set of Δ least significant digits, the set of Δ least significant digits being substantially the largest number of least significant digits that can be discarded without causing the multiplier array to deviate from the true rounded value of

$\frac{px}{q}$

for any x between 0 and M.

The fixed integer b may be the integer having the smallest Hamming weight which satisfies said operation for all x.

In the case that (a) is satisfied by a smaller integer k than (b), if there is more than one value of b having the same smallest Hamming weight, the fixed integer b may be the smallest value of b.

The multiplier may make use of a canonical signed digit representation.

The multiplier array may be unable to perform multiplication by a variable.

The binary logic circuit may be configured to determine the rounded value of

$\frac{px}{q}$

according to any one of the following rounding schemes: round towards zero (RTZ), round towards negative infinity (RTN), round towards positive infinity (RTP), and round towards nearest with ties to upper (RTU).

In embodiments, a machine readable storage medium having encoded thereon non-transitory machine readable code can be provided for generating the binary logic circuit.

According to a second aspect, there is provided a fixed point filter comprising one or more binary logic circuits configured according to the teaching herein.

According to a third aspect, there is provided a method of deriving a hardware representation of a binary logic circuit configured to determine a rounded value of

$\frac{px}{q},$

where p and q are coprime constant integers with p<q and q≠2^(i), i is any integer, and x is an integer variable between 0 and integer M where M≧2q, the method comprising:

-   -   determining an integer k being the smallest integer that         satisfies either:

$\begin{matrix} {{\frac{2^{k}}{\left( {p\; 2^{k}} \right){mod}\mspace{11mu} q} > {{q\left\lfloor \frac{M}{q} \right\rfloor} - q + p^{- 1}}};{or}} & (a) \\ {\frac{2^{k}}{\left( {{- p}\; 2^{k}} \right){mod}\mspace{11mu} q} > {M - \left( {\left( {M + p^{- 1}} \right){mod}\mspace{11mu} q} \right)}} & (b) \end{matrix}$

-   -   determining fixed integers a and b where:         -   if (a) is satisfied by a smaller integer k than (b),             calculating a as the integer given by

$\left\lbrack {{\left\lfloor \frac{M}{q} \right\rfloor \left( {\left( {p\; 2^{k}} \right){mod}\mspace{11mu} q} \right)},{\frac{2^{k} + {\left( {q - p^{- 1}} \right)\left( {\left( {p\; 2^{k}} \right){mod}\mspace{11mu} q} \right)}}{q} - 1}} \right\rbrack,$

-   -    and selecting b from the set of one or more integers in the         range

$\left\lbrack {0,{\frac{2^{k} - {\left( {M - \left( {\left( {M + p^{- 1}} \right){mod}\mspace{11mu} q} \right)} \right)\left( {\left( {{- p}\; 2^{k}} \right){mod}\mspace{14mu} q} \right)}}{q} - 1}} \right\rbrack;$

-   -    and         -   if (b) is satisfied by a smaller integer k than (a),             calculating a as the integer given by

$\frac{{ax} + b}{2^{k}}$

-   -    and selecting b from the set of one or more integers in the         range

$\left\lbrack {0,{\frac{2^{k} - {\left( {M - \left( {\left( {M + p^{- 1}} \right)\mspace{11mu} {mod}\mspace{20mu} q} \right)} \right)\left( {\left( {{- p}\; 2^{k}} \right)\mspace{11mu} {mod}\mspace{20mu} q} \right)}}{q} - 1}} \right\rbrack;$

and

-   -   deriving a hardware representation for a binary logic circuit         configured to implement the operation:

$\frac{{ax} + b}{2^{k}}$

using the determined fixed integers a, b and k.

Deriving the hardware representation for the binary logic circuit may comprise implementing said operation using a binary multiplier array having a plurality of rows, a first subset of the plurality of rows being configured to perform multiplication by the fixed integer a, a second subset of the plurality of rows being configured to perform the addition of b, and the rounded value being the output of the multiplier array right-shifted by k binary digits.

The method may further comprise modifying said hardware representation by truncating a set of Δ least significant digits from the plurality of rows, the set of Δ least significant digits being substantially the largest set of least significant digits that can be discarded without causing the operation implemented by the binary logic circuit to deviate from the true rounded value of

$\frac{px}{q}$

for any x between 0 and M.

The fixed integer b may be selected to be the integer having the smallest Hamming weight that satisfies the truncated hardware representation for the binary logic circuit.

Deriving the hardware representation may comprise selecting a multiplier array incapable of performing multiplication of integer x by a variable factor.

The hardware representation may be RTL, a hardware description language, or a gate-level description language.

In embodiments, a computer readable storage medium having encoded thereon non-transitory computer readable code can be provided for generating a hardware representation according to the method of the third aspect of the present invention.

According to a fourth aspect, there is provided a binary logic circuit configured to determine a rounded value of

$\frac{p*x*r}{q},$

where p and q are coprime constant integers with p<q and q≠2^(i), r is a positive integer, i is any integer, and x is an integer variable between integers A and B where (B−A)≧2q, the binary logic circuit being configured to implement the operation:

$\frac{{ax} + b}{2^{k}}$

where a and b are fixed integers and k is the smallest integer that satisfies either:

$\begin{matrix} {{\frac{2^{k}}{\left( {p\; 2^{k}} \right){mod}\mspace{20mu} q} > {\beta_{\min}^{-} - \beta_{\max}^{-}}}{{where},{\beta_{\max}^{-} = {A + {\left( {{- A} - {P_{q}^{- 1}\left( {r + 1} \right)}} \right)\mspace{11mu} {mod}\mspace{20mu} q}}}}{\beta_{\min}^{-} = {B - {\left( {B + {r*P_{q}^{- 1}}} \right)\mspace{11mu} {mod}\mspace{20mu} q}}}{{or}:}} & (a) \\ {{\frac{2^{k}}{\left( {{- p}\; 2^{k}} \right)\mspace{11mu} {mod}\mspace{20mu} q} > {\beta_{\max}^{+} - \beta_{\min}^{+}}}{{where},{\beta_{\max}^{+} = {B - {\left( {B + {P_{q}^{- 1}\left( {r + 1} \right)}} \right)\mspace{11mu} {mod}\mspace{20mu} q}}}}{\beta_{\min}^{+} = {A + \left( {{- A} - {r*{P_{q}^{- 1}\left( {r + 1} \right)}\mspace{11mu} {mod}\mspace{20mu} q}} \right.}}} & (b) \end{matrix}$

wherein:

-   -   if (a) is satisfied by a smaller integer k than (b), then a is         an integer given by

$\left\lfloor \frac{p\; 2^{k}}{q} \right\rfloor$

-   -    and b is an integer in the range

$\left\lbrack {\frac{{r\; 2^{k}} + {\beta_{\min}^{-}*\left( {p\; 2^{k}} \right)\mspace{11mu} {mod}\mspace{20mu} q}}{q},{\frac{\; {{2^{k}\left( {r + 1} \right)} + {\beta_{\max}^{-}*\left( {p\; 2^{k}} \right){mod}\mspace{20mu} q}}}{q} - 1}} \right\rbrack;$

-   -    and     -   if (b) is satisfied by a smaller integer k than (a), then a is         an integer given by

$\left\lceil \frac{p\; 2^{k}}{q} \right\rceil$

-   -    and b is an integer in the range

$\left\lbrack {\frac{{r\; 2^{k}} - {\beta_{\min}^{+}*\left( {{- p}\; 2^{k}} \right){mod}\mspace{20mu} q}}{q},{\frac{\; {{2^{k}\left( {r + 1} \right)} - {\beta_{\max}^{+}*\left( {{- p}\; 2^{k}} \right){mod}\mspace{20mu} q}}}{q} - 1}} \right\rbrack.$

According to a fifth aspect, there is provided a method of deriving a hardware representation of a binary logic circuit configured to determine a rounded value of

$\frac{{p*x} + r}{q},$

wherein p and q are coprime constant integers with p<q and q≠2^(i), r is a positive integer, i is any integer, and x is an integer variable between integers A and B where (B−A)≧2q, the method comprising:

-   -   determining an integer k being the smallest integer that         satisfies either:

$\begin{matrix} {{\frac{2^{k}}{\left( {p\; 2^{k}} \right){mod}\mspace{20mu} q} > {\beta_{\min}^{-} - \beta_{\max}^{-}}}{{where},{\beta_{\max}^{-} = {A + {\left( {{- A} - {P_{q}^{- 1}\left( {r + 1} \right)}} \right)\mspace{11mu} {mod}\mspace{20mu} q}}}}{\beta_{\min}^{-} = {B - {\left( {B + {r*P_{q}^{- 1}}} \right)\mspace{11mu} {mod}\mspace{20mu} q}}}{{or}:}} & (a) \\ {{\frac{2^{k}}{\left( {{- p}\; 2^{k}} \right)\mspace{11mu} {mod}\mspace{20mu} q} > {\beta_{\max}^{+} - \beta_{\min}^{+}}}{{where},{\beta_{\max}^{+} = {B - {\left( {B + {P_{q}^{- 1}\left( {r + 1} \right)}} \right)\mspace{11mu} {mod}\mspace{20mu} q}}}}{\beta_{\min}^{+} = {A + \left( {{- A} - {r*{P_{q}^{- 1}\left( {r + 1} \right)}\mspace{11mu} {mod}\mspace{20mu} q}} \right.}}} & (b) \end{matrix}$

-   -   determining fixed integers a and b where:         -   if (a) is satisfied by a smaller integer k than (b),             calculating a as the integer given by

$\left\lfloor \frac{p\; 2^{k}}{q} \right\rfloor$

-   -    and selecting b from the set of one or more integers in the         range

$\left\lbrack {\frac{{r\; 2^{k}} + {\beta_{\min}^{-}*\left( {p\; 2^{k}} \right){mod}\mspace{20mu} q}}{q},{\frac{\; {{2^{k}\left( {r + 1} \right)} + {\beta_{\max}^{-}*\left( {p\; 2^{k}} \right){mod}\mspace{20mu} q}}}{q} - 1}} \right\rbrack,$

-   -    and         -   if (b) is satisfied by a smaller integer k than (a),             calculating a as the integer given by

$\left\lceil \frac{p\; 2^{k}}{q} \right\rceil$

-   -    and selecting b from the set of one or more integers in the         range

$\left\lbrack {\frac{{r\; 2^{k}} - {\beta_{\min}^{+}*\left( {{- p}\; 2^{k}} \right){mod}\; q}}{q},{\frac{{2^{k}\left( {r + 1} \right)} - {\beta_{\max}^{+}*\left( {{- p}\; 2^{k}} \right){mod}\; q}}{q} - 1}} \right\rbrack;$

and

-   -   deriving a hardware representation for a binary logic circuit         configured to implement the operation:

$\frac{{ax} + b}{2^{k}}$

using the determined fixed integers a, b and k.

BRIEF DESCRIPTION OF THE DRAWINGS

Aspects of the disclosure will now be explained by way of example with reference to the accompanying drawings. In the drawings:

FIG. 1 is a schematic illustration of the multiply, add and shift operations performed by a multiplication array and adder unit in accordance with the examples described herein.

FIG. 2 is an illustration of a solution space.

FIG. 3 illustrates the advantages of implementing multiplication by a constant fraction using a 40 nm process according to the principles taught herein.

FIG. 4 illustrates a fixed point multiplication array from which a set of least significant binary digits Δ are removed.

FIG. 5 is a schematic diagram of a fixed point filter.

FIG. 6 is a schematic diagram of a logic circuit configured in accordance with the principles described herein.

FIG. 7 is a flowchart illustrating a method according to the principles described herein.

DETAILED DESCRIPTION

The following description is presented by way of example to enable any person skilled in the art to make and use implementations of the disclosure. Implementations are not limited to the embodiments described herein and various modifications to the disclosed embodiments will be readily apparent to those skilled in the art.

There is a need for improved integrated circuit logic implementing multiplication by a constant fraction as a multiply-add operation in its most efficient form.

Consider the operation

$\frac{px}{q},$

where p and q are integer constants and x is an integer variable. Such a multiplication by a constant fraction is common in hardware implementations of fixed point filters, for example:

y= 1/7a+ 2/7bt+ 3/7ct ²+ 1/7dt ³

In this example, the fixed point filter requires division by a constant divisor of 7. Conventionally such an operation would be implemented using complex logic designed for non-constant division, but a significant reduction in hardware complexity can be achieved by expressing the operation in the form

$\frac{{ax} + b}{2^{k}},$

which represents a multiply-add operation whose result is right-shifted by k binary places.

A fixed point filter 501 configured in accordance with the present example is shown in FIG. 5. The filter receives an input value t and provides an output value y at a predetermined level of precision. The filter 501 comprises multiply-add logic 502 for performing multiplication by the constant fractions 1/7, 2/7 and 3/7 as required by the filter. These operations could be performed by one or more sets of multiply-add logic 502 each configured to perform multiplication by a fraction having a constant divisor of 7.

For fixed point operations, the multiplication by a constant fraction operation to be performed is:

${Round}\left( \frac{px}{q} \right)$

where round is performed according to the selected rounding scheme for the system concerned. Rounding schemes include, for example, round towards zero (RTZ), round towards negative infinity (RTN), round towards positive infinity (RTP), and round towards nearest with ties to upper (RTU). In the above operation, p and q are natural numbers and x is a positive integer between 0 and M. The following mathematical analysis also assumes that p and q are coprime constants and that:

p<q q≠2^(i) M≧2q

With a round towards negative infinity (RTN) or round towards zero (RTZ) scheme, the multiplication by a constant fraction operation can be expressed as the floor of a multiply-add operation:

$\left\lfloor \frac{px}{q} \right\rfloor = {\left\lfloor \frac{{ax} + b}{2^{k}} \right\rfloor = {\left( {{ax} + b} \right)k}}$

The rightmost notation indicates that the multiplication by a constant fraction operation reduces to a multiplication of the variable x by a constant ‘a’ followed by an addition of a constant ‘b’, with the result right-shifted by k places. This can be implemented very efficiently in hardware, for example through the use of a multiplication array and an adder unit. Shifting by a constant value k does not require any kind of hardware logic: this step can be achieved simply by hardwiring the binary output digits of the adder unit in the appropriate manner.

A binary logic circuit 605 for performing multiplication by a constant fraction in the manner of multiply-add logic 502 is shown in FIG. 6. The logic circuit comprises logic for performing multiplication a*x 601, logic for performing addition of constant b 602 and a shift 603. So as to maximise speed and reduce the complexity of the binary logic circuit, it is advantageous if the addition logic 602 is merged with the multiplication logic 601. For example, in preferred embodiments the binary logic circuit is a multiplier array comprising a two or more rows configured to effect multiplication by the constant integer a, with the addition of constant b being performed at the multiplier array by introducing the value b as an additional row in the array. It is envisaged that at design time a reduction scheme is employed to reduce the height of the multiplication array as far as possible. This can help to reduce the height of an array to a substantially minimum number of rows. Shift 603 can be performed through appropriate hardwiring of the binary digits calculated at the logic circuit to the output of the logic circuit 605. No logic is required to implement a shift. An accumulator 604 can optionally be provided at the output of the logic circuit. The accumulator could form part of logic circuit 605 or be provided separately. No logic need be required to implement an accumulator.

The multiplier array 601 receives a value x which it multiplies by a constant a by means of logic optimised for performing that specific multiplication operation. The architecture of multiplier array 601 is such so as to perform multiplication by the fixed constant a (e.g. is preferably adapted for performing multiplication only by fixed constant a). It is advantageous if the array is not a generic multiplier configured for performing multiplication by a variable (e.g. a value specified at runtime). As has been discussed, this minimises the complexity and integrated circuit area consumed by the multiplier logic. Adder 602 performs an addition of a constant value b to the result from the multiplier array. Shift 603 then right-shifts the output of the adder by k places and the final output

$\frac{{ax} + b}{2^{k}}$

is formed at the accumulator 604. Typically the shift would be achieved through suitable hardwiring of the output of the adder to the register elements of accumulator 604.

FIG. 1 schematically illustrates the multiply, add and shift operations performed by an array and adder unit in order to calculate

$\frac{{ax} + b}{2^{k}}.$

Each dot represents a binary digit with the constant multiplication of the variable ‘x’ by ‘a’ being performed by means of an array of addition operations 101 as is known in the art. The result of the addition of binary constant ‘b’ at 102 is then shifted by k places as indicated by 103 in order to generate the binary output 104 representing the floor of

$\frac{px}{q}.$

The negative signs before rows in the multiplication array indicate that, in the example, a canonical signed digit representation has been employed to decrease the Hamming weight of the binary values represented by those rows. This can often allow the multiplication array to be expressed more efficiently in hardware and consume a smaller integrated circuit area.

Typically there are many values of a, b and k which satisfy the above equation but that are difficult to identify using conventional simulation techniques. In order to minimise the complexity of the resulting hardware implementation, the inventor has identified that it is advantageous to select a minimum value of k. This has the effect of minimising the value of a and hence reducing the size of the multiplication array performing the operation a*x. Once the minimum values of k and a have been identified, a corresponding range of possible values of b can be identified. This freedom in b is used to remove least significant bits from the multiplier array. Typically the optimum value of b will correspond to a small value of b in the identified range having a small Hamming weight. As will now be shown, this solution represents the maximally efficient expression of

$\frac{px}{q}$

in terms of binary multiply-add operations.

General expressions for the minimum value of k will now be derived for given integers p and q. A mathematical proof that this value of k represents the optimum solution will also be set out.

Existence and Feasibility of k

Firstly we check whether k always exists. It is always possible to find sufficiently large values for a and k such that, for any positive x:

$0 \leq \left( {\frac{a}{2^{k}} - \frac{p}{q}} \right) < \frac{1}{qx}$ $0 \leq {{\left( {\frac{a}{2^{k}} - \frac{p}{q}} \right)x} + \frac{q - 1}{q}} < 1$ $0 \leq {{\left( {\frac{a}{2^{k}} - \frac{p}{q}} \right)x} + \frac{({px}){mod}\; q}{q}} < 1$ $0 \leq {\frac{ax}{2^{k}} - \left\lfloor \frac{px}{q} \right\rfloor} < 1$ ${Hence},{\left\lfloor \frac{ax}{2^{k}} \right\rfloor = \left\lfloor \frac{px}{q} \right\rfloor}$

and feasible k always exists. In fact, if k is feasible then so is k+1 because:

$\left\lfloor \frac{{ax} + b}{2^{k}} \right\rfloor = \left\lfloor \frac{{\left( {2a} \right)x} + \left( {2b} \right)}{2^{k + 1}} \right\rfloor$

The value k=0 can be readily shown to be infeasible because if k=0 then

$\left\lfloor \frac{px}{q} \right\rfloor = {{ax} + b}$

Trying x=0 and x=q yields

$\begin{matrix} {0 = b} & {p = {aq}} & {\frac{p}{q} = a} \end{matrix}$

But a is an integer and p<q so k=0 is infeasible. We can therefore conclude that the set of feasible k is of the form

[k _(min),∞)

We can further conclude that the value of a corresponding to the minimum value solution for k is odd. If a was even then the following would be true and the minimum value of k would not be minimal.

$\left\lfloor \frac{{ax} + b}{2^{k}} \right\rfloor = \left\lfloor \frac{{\left( {a/2} \right)x} + \left\lfloor {b/2} \right\rfloor}{2^{k - 1}} \right\rfloor$

Hence when k=k_(min) then a is odd.

FIG. 2 illustrates the solution space for the values of α and β that satisfy

$\left\lfloor \frac{px}{q} \right\rfloor = \left\lfloor {{ax} + \beta} \right\rfloor$

where α,βεR. By the following lemma, the solution space shown in FIG. 2 is convex.

Lemma Showing the Solution Space is Convex

Consider

└α₁ x+β ₁┘=└α₂ x+β ₂┘ α_(i),β_(i) εR

Then the following must be true

└αx+β┘=└α ₁ x+β ₁┘=└α₂ x+β ₂┘

where

α=(1−λ)α₁+λα₂ β=(1−λ)β₁+λβ₂ λε[0,1]

This result can be proved as follows:

$\begin{matrix} {{{{\alpha_{i}x} + \beta_{i}} = {c + d_{i}}}\mspace{11mu}} & {c \in Z} & {d_{i} \in \left\lbrack {0,1} \right)} \end{matrix}\mspace{20mu}$ $\begin{matrix} {\left\lfloor {{ax} + \beta} \right\rfloor = \left\lfloor {{\left( {1 - \lambda} \right)\left( {{\alpha_{1}x} + \beta_{1}} \right)} + {\lambda \left( {{\alpha_{2}x} + \beta_{2}} \right)}} \right\rfloor} \\ {= {c + \left\lfloor {{\left( {1 - \lambda} \right)d_{1}} + {\lambda \; d_{2}}} \right\rfloor}} \\ {= {c = \left\lfloor {{\alpha_{i}x} + \beta_{i}} \right\rfloor}} \end{matrix}$

Hence the solution space is convex.

Corollary Proving a and k are Feasible

A corollary of the above lemma is that we can prove that a and k are feasible:

If

$\mspace{31mu} \begin{matrix} {\left\lfloor \frac{px}{q} \right\rfloor = {\left\lfloor {{\alpha_{1}x} + \beta_{1}} \right\rfloor = \left\lfloor {{\alpha_{2}x} + \beta_{2}} \right\rfloor}} & {\alpha_{i},{\beta_{i} \in R}} & {x \in Z} \end{matrix}$

Then assuming there exists

$\alpha_{1} < \frac{a}{2^{k}} < \alpha_{2}$

then there must exist

$\begin{matrix} {\lambda \in \left\lbrack {0,1} \right\rbrack} & {\frac{a}{2^{k}} = {{\left( {1 - \lambda} \right)\alpha_{1}} + {\lambda \; \alpha_{2}}}} \end{matrix}$

For this λ let

β=(1−λ)β₁+λβ₂

Then

$\begin{matrix} {{\left\lfloor \frac{px}{q} \right\rfloor = {\left\lfloor {{\frac{a}{2^{k}}x} + \beta} \right\rfloor = {\left\lfloor \frac{{ax} + \left\lfloor {2^{k}\beta} \right\rfloor}{2^{k}} \right\rfloor = \left\lfloor \frac{{ax} + b}{2^{k}} \right\rfloor}}}\mspace{14mu}} & {b = \left\lfloor {2^{k}\beta} \right\rfloor} \end{matrix}$

Hence we can conclude that a and k are feasible if

$\begin{matrix} {\alpha_{i} \in R} & {\alpha_{1} < \frac{a}{2^{k}} < \alpha_{2}} \end{matrix}$

In fact, when k is a minimum then a must be unique because if not then

$\begin{matrix} {\left\lfloor \frac{{a_{1}x} + b_{1}}{2^{k}} \right\rfloor = \left\lfloor \frac{{a_{2}x} + b_{2}}{2^{k}} \right\rfloor} & {a_{1} \neq a_{2}} \end{matrix}$

and by the above lemma, every real number in the following interval is feasible

$\left\lbrack {\frac{a_{1}}{2^{k}},\frac{a_{2}}{2^{k}}} \right\rbrack$

Given a₁ and a₂ are odd then there would exist an even value of a between them that is also feasible, which is a contradiction on k being minimal. Hence a must be unique.

Values of a Corresponding to Minimum k

We can now identify the value of a which corresponds to the minimum value of k.

If the following were true

$a_{\min} > {\left\lceil \frac{p\; 2^{k}}{q} \right\rceil \mspace{14mu} {then}}$ $\frac{p}{q} < {\frac{1}{2^{k}}\left\lceil \frac{p\; 2^{k}}{q} \right\rceil} < \frac{a_{\min}}{2^{k}}$

By the above corollary

$a = \left\lceil \frac{p\; 2^{k}}{q} \right\rceil$

would also be feasible. But this would be a contradiction on a_(min) being unique. Hence

$\begin{matrix} {a_{\min} \leq \left\lceil \frac{p\; 2^{k}}{q} \right\rceil} & ({A1}) \end{matrix}$

Similarly, if the following were true

$a_{\min} < {\left\lceil \frac{p\; 2^{k}}{q} \right\rceil \mspace{14mu} {then}}$ $\frac{a_{\min}}{2^{k}} < {\frac{1}{2^{k}}\left\lfloor \frac{p\; 2^{k}}{q} \right\rfloor} < \frac{p}{q}$

And by the above corollary

$a = \left\lfloor \frac{p\; 2^{k}}{q} \right\rfloor$

would also be feasible. But this would be a contradiction on a_(min) being unique. Hence

$\begin{matrix} {a_{\min} \geq \left\lfloor \frac{p\; 2^{k}}{q} \right\rfloor} & ({A2}) \end{matrix}$

In conclusion, when k is at a minimum, the corresponding value of a is one of:

$\left\lfloor \frac{p\; 2^{k}}{q} \right\rfloor \mspace{14mu} {and}$ $\left\lceil \frac{p\; 2^{k}}{q} \right\rceil$

In other words, the value of a when k is at a minimum is the floor of

$\frac{p\; 2^{k}}{q}$

or the ceiling of

$\frac{p\; 2^{k}}{q}.$

Value of b for the Case a=Floor(p2^(k)/q)

We can now identify the value of b when k is at a minimum and a is the floor of

$\frac{p\; 2^{k}}{q}.$

Using the following identity

$\left\lfloor \frac{A}{B} \right\rfloor = \frac{A - \left( {{A{mod}}\; B} \right)}{B}$

we can identify the necessary conditions on k and b to satisfy

$a = {\left\lfloor \frac{p\; 2^{k}}{q} \right\rfloor.}$

$\begin{matrix} {{\left\lfloor \frac{px}{q} \right\rfloor = \left\lfloor \frac{{ax} + b}{2^{k}} \right\rfloor}{0 \leq {\frac{{ax} + b}{2^{k}} - \left\lfloor \frac{px}{q} \right\rfloor} < 1}{0 \leq {{\left( {{aq} - {p\; 2^{k}}} \right)x} + {2^{k}\left( {({px}){mod}{\mspace{14mu} \;}q} \right)} + {bq}} < {q\; 2^{k}}}{0 \leq {{2^{k}\left( {({px}){mod}{\mspace{14mu} \;}q} \right)} - {x\left( {\left( {p\; 2^{k}} \right){mod}\mspace{20mu} q} \right)} + {bq}} < {q\; 2^{k}}}} & (F) \end{matrix}$

In order to find k and b that satisfy expression (F), we need to bound the function f(x) which we define as:

f(x)=2^(k)((px)mod q)−x((p2^(k))mod q)

Trying x=x_(max)=q−p⁻¹ where p⁻¹ p=1 mod q (which always exists because p and q are coprime) and rearranging the upper bound of expression (F) we get:

$b < \frac{2^{k} + {\left( {q - p^{- 1}} \right)\left( {\left( {p\; 2^{k}} \right){mod}\mspace{20mu} q} \right)}}{q}$

which is an integer.

Now trying the substitution

$x = {x_{\min} = {q\left\lfloor \frac{M}{q} \right\rfloor}}$

and rearranging the lower bound of expression (F) we get:

${\left\lfloor \frac{M}{q} \right\rfloor \left( {\left( {p\; 2^{k}} \right){mod}\mspace{20mu} q} \right)} \leq b$

We can therefore conclude that the necessary condition on b is:

$\begin{matrix} {b\; \in \; \left\lbrack {{\left\lfloor \frac{M}{q} \right\rfloor \left( {\left( {p\; 2^{k}} \right){mod}{\mspace{14mu} \;}q} \right)},{\frac{2^{k} + {\left( {q - p^{- 1}} \right)\left( {\left( {p\; 2^{k}} \right){mod}\mspace{20mu} q} \right)}}{q} - 1}} \right\rbrack} & \left( {B\; 1} \right) \end{matrix}$

This interval must be non-empty for b to exist. In other words, the following must be true:

${\left\lfloor \frac{M}{q} \right\rfloor \left( {\left( {p\; 2^{k}} \right){mod}\mspace{20mu} q} \right)} < \frac{2^{k} + {\left( {q - p^{- 1}} \right)\left( {\left( {p\; 2^{k}} \right){mod}\mspace{20mu} q} \right)}}{q}$

and hence

$\frac{2^{k}}{\left( {p\; 2^{k}} \right){mod}\mspace{20mu} q} > {{q\left\lfloor \frac{M}{q} \right\rfloor} - q + p^{- 1}}$

These necessary conditions on k are actually sufficient because it follows from the preceding equation and the initial condition

$M \geq {2\; {q\left\lfloor \frac{M}{q} \right\rfloor}} \geq 2$

that

$\frac{2^{k}}{\left( {p\; 2^{k}} \right){mod}\mspace{20mu} q} > q$

We can now identify the bounds on our function f(x). Rewriting f(x) as

$\frac{f(x)}{2^{k}} = {\underset{\begin{matrix}  \\ {\in {\lbrack{0,{q - 1}}\rbrack}} \end{matrix}}{\left( {({px}){mod}\; q} \right)} - \underset{\begin{matrix}  \\ {< {x\text{/}q}} \end{matrix}}{x\frac{\left( {p\; 2^{k}} \right){mod}\; q}{2^{k}}}}$

we can conclude that the maximum f(x) is attained for the smallest x such that

(px)mod q=q−1

and hence

x _(max) =q−p ⁻¹ (X_MAX_L)

And the minimum f(x) is attained for the largest x such that

(px)mod q=0

and hence

$\begin{matrix} {x_{\min} = {q\left\lfloor \frac{M}{q} \right\rfloor}} & \left( {M_{—}{MIN}_{—}L} \right) \end{matrix}$

It will be appreciated that the equations (X_MAX_L) and (X_MIN_L) represent tight bounds on x for the case

$a = {\left\lfloor \frac{p\; 2^{k}}{q} \right\rfloor.}$

Value of b for the Case a=Ceiling(p2^(k)/q)

We can now identify the value of b when k is at a minimum and a is the ceiling of

$\frac{p\; 2^{k}}{q}.$

Using the following identity

$\left\lceil \frac{A}{B} \right\rceil = \frac{A + \left( {\left( {- A} \right){mod}\mspace{14mu} B} \right)}{B}$

we can identify the necessary conditions on k and b to satisfy

$a = {\left\lceil \frac{p\; 2^{k}}{q} \right\rceil.}$

$\begin{matrix} {{\left\lfloor \frac{px}{q} \right\rfloor = \left\lfloor \frac{{ax} + b}{2^{k}} \right\rfloor}{0 \leq {\frac{{ax} + b}{2^{k}} - \left\lfloor \frac{px}{q} \right\rfloor} < 1}{0 \leq {{\left( {{aq} - {p\; 2^{k}}} \right)x} + {2^{k}\left( {({px}){mod}\; q} \right)} + {bq}} < {q\; 2^{k}}}{0 \leq {{2^{k}\left( {({px}){mod}\; q} \right)} + {x\left( {\left( {{- p}\; 2^{k}} \right){mod}\; q} \right)} + {bq}} < {q\; 2^{k}}}} & (G) \end{matrix}$

In order to find k and b that satisfy expression (G), we need to bound the function g(x) which we define as:

g(x)=2^(k)((px)mod q)+x((−p2^(k))mod q)

Trying

x=x _(max) =M−((M+p ⁻¹)mod q)

and rearranging the upper bound of expression (G) we get:

$b < \frac{2^{k} - {\left( {M - \left( {\left( {M + p^{- 1}} \right){mod}\mspace{14mu} q} \right)} \right)\left( {\left( {{- p}\; 2^{k}} \right){mod}\mspace{14mu} q} \right)}}{q}$

which is an integer.

Now trying the substitution x=x_(min)=0 and rearranging the lower bound of expression (G) we get:

0≦b

We can therefore conclude that the necessary condition on b is:

$\begin{matrix} {b \in \left\lbrack {0,{\frac{2^{k} - {\left( {M - \left( {\left( {M + p^{- 1}} \right){mod}\mspace{14mu} q} \right)} \right)\left( {\left( {{- p}\; 2^{k}} \right){mod}\mspace{14mu} q} \right)}}{q} - 1}} \right\rbrack} & \left( {B\; 2} \right) \end{matrix}$

This interval must be non-empty for b to exist. In other words, the following must be true:

0<2^(k)−(M−((M+p ⁻¹)mod a))((−p2^(k))mod q)

and hence

$\frac{2^{k}}{\left( {{- p}\; 2^{k}} \right){mod}\mspace{14mu} q} > {M - \left( {\left( {M + p^{- 1}} \right){mod}\mspace{14mu} q} \right)}$

These necessary conditions on k are actually sufficient because it follows from the preceding equation and the initial condition

$\left. {M \geq {2q}}\Rightarrow{\left\lfloor \frac{M}{q} \right\rfloor \geq 2} \right.$

that

$\frac{2^{k}}{\left( {{- p}\; 2^{k}} \right){mod}\; q} > q$

We can now identify the bounds on our function g(x). Rewriting g(x) as

$\frac{g(x)}{2^{k}} = {\underset{\begin{matrix}  \\ {\in {\lbrack{0,{q - 1}}\rbrack}} \end{matrix}}{\left( {({px}){mod}\; q} \right)} + \underset{\begin{matrix}  \\ {< {x\text{/}q}} \end{matrix}}{x\frac{\left( {{- p}\; 2^{k}} \right){mod}\; q}{2^{k}}}}$

we can conclude that the maximum g(x) is attained for the largest x such that

(px)mod q=q−1

and hence

x=x _(max) =M−((M+p ⁻¹)mod q) (X_MAX_U)

And the minimum g(x) is attained for

x _(min)=0 (X_MIN_U)

It will be appreciated that the equations (X_MAX_U) and (X_MIN_U) represent tight bounds on x for the case

$a = {\left\lceil \frac{p\; 2^{k}}{q} \right\rceil.}$

Optimal Parameter Selection

Using the values of a and b derived above (see equations A1, A2 and B1, B2) which represent necessary and sufficient conditions on k, we obtain the following two sets of conditions on k, a and b which represent optimal solutions for expressing multiplication by a constant fraction in the form

$\frac{{ax} + b}{2^{k}}.$

Set 1

$k_{\min}^{-} = {\min \left( {{k\text{:}\frac{2^{k}}{\left( {p\; 2^{k}} \right){mod}\mspace{14mu} q}} > {{q\left\lfloor \frac{M}{q} \right\rfloor} - q + p^{- 1}}} \right)}$

i.e. k_(min) ⁻ is the smallest value of k that satisfies

$\frac{2^{k}}{\left( {p\; 2^{k}} \right){mod}\mspace{14mu} q} > {{q\left\lfloor \frac{M}{q} \right\rfloor} - q + p^{- 1}}$

$a_{\min}^{-} = \left\lfloor \frac{p\; 2^{k_{\min}^{-}}}{q} \right\rfloor$ $b \in \left\lbrack {{\left\lfloor \frac{M}{q} \right\rfloor \left( {\left( {p\; 2^{k_{\min}^{-}}} \right){mod}\; q} \right)},{\frac{2^{k_{\min}^{-}} + {\left( {q - p^{- 1}} \right)\left( {\left( {p\; 2^{k_{\min}^{-}}} \right){mod}\; q} \right)}}{q} - 1}} \right\rbrack$

Set 2

$k_{\min}^{+} = {\min \left( {{k\text{:}\frac{2^{k}}{\left( {{- p}\; 2^{k}} \right){mod}\mspace{14mu} q}} > {M - \left( {\left( {M + p^{- 1}} \right){mod}\mspace{14mu} q} \right)}} \right)}$

i.e. k_(min) ⁺ is the smallest value of k that satisfies

$\frac{2^{k}}{\left( {{- p}\; 2^{k}} \right){mod}\mspace{14mu} q} > {M - \left( {\left( {M + p^{- 1}} \right){mod}\mspace{14mu} q} \right)}$

$a_{\min}^{+} = \left\lceil \frac{p\; 2^{k_{\min}^{+}}}{q} \right\rceil$ $b_{\min}^{+} \in \left\lbrack {0,{\frac{2^{k_{\min}^{+}} - {\left( {M - \left( {\left( {m + p^{- 1}} \right){mod}\; q} \right)} \right)\left( {\left( {{- p}\; 2^{k_{\min}^{+}}} \right){mod}\; q} \right)}}{q} - 1}} \right\rbrack$

The optimum solution is that set of k, a and b which correspond to the smallest of k_(min) ⁻ and k_(min) ⁺.

The optimum solution provides the most efficient logic implementation of a multiplier array for performing the operation round

$\left( \frac{px}{q} \right)$

for all values of p and q that satisfy the initial set of constraints. This is particularly useful for values of p and q for which the optimum logic implementation has a complex relationship to the ratio p/q. Examples of such values of p and q include the set of ratios p/q where p>1, and the set of ratios p/q where p=1 and q!=(2̂j)*((2̂i)±1)) for all integer i, j.

Example

By way of an example, consider determining the optimum multiply-add solution for the following multiplication by a constant fraction operation in which p=7, q=9 and M=255 (i.e. performed to a fixed point precision of 8 bits).

$\frac{7x}{9} = \frac{{ax} + b}{2^{k}}$

In order to identify the optimal set of a, b and k we determine k_(min) ⁻ and k_(min) ⁺:

$k_{\min} = {\min \left( {{k\text{:}\frac{2^{k}}{\left( {7*2^{k}} \right){mod}\mspace{14mu} 9}} > 247} \right)}$ $k_{\min}^{+} = {\min \left( {{k\text{:}\frac{2^{k}}{\left( {{- 7}*2^{k}} \right){mod}\mspace{14mu} 9}} > 248} \right)}$

Trying k=7 and 8, for k_(min) ⁻ we get:

$\frac{2^{7}}{\left( {7*2^{7}} \right){mod}\; 9} = 25.6$ $\frac{2^{8}}{\left( {7*2^{8}} \right){mod}\; 9} = 256$

and for k_(min) ⁺ we get:

$\frac{2^{7}}{\left( {{- 7}*2^{7}} \right){mod}\mspace{14mu} 9} = 32$ $\frac{2^{8}}{\left( {{- 7}*2^{8}} \right){mod}\; 9} = 32$

Hence k_(min)=8 and we use the first set of k_(min) ⁻, a_(min) ⁻ and b_(min) ⁻.

The value of a is therefore

$a_{\min}^{-} = {\left\lfloor \frac{7*2^{8}}{9} \right\rfloor = 199}$

and the value of b is

${b^{-} \in \left\lbrack {{\left\lfloor \frac{255}{9} \right\rfloor \left( {\left( {7*2^{8}} \right){mod}\mspace{14mu} 9} \right)},{\frac{2^{8} + {\left( {9 - 7^{- 1}} \right)\left( {\left( {7*2^{8}} \right){mod}\mspace{14mu} 9} \right)}}{9} - 1}} \right\rbrack} = {\left\lbrack {28,28} \right\rbrack = 28}$

Thus, the optimal multiply-add expression of the multiplication by a constant fraction operation is:

$\begin{matrix} {\left\lfloor \frac{7x}{9} \right\rfloor = \left\lfloor \frac{{199x} + 28}{2^{8}} \right\rfloor} & ({OPT}) \end{matrix}$

FIG. 3 illustrates the advantages of implementing the multiplication by a constant fraction operation of the present example using the optimal solution. The bottom axis of the plot in FIG. 3 represents delay in ns and the left-hand axis represents area in square micrometres. Line 301 connects points in the plot representing the operational delay and area consumed by each of a set of logic designs generated by conventional logic synthesis software for performing the present multiplication by a constant fraction operation using non-constant division logic. Line 302 connects points in the plot representing the operational delay and area consumed by each of a set of logic designs that implement present multiplication by a constant fraction operation according to the optimal multiply-add operation expressed in equation (OPT) above. As can be seen from the plot, logic designs implemented according to the optimal design solution taught herein are around four times smaller in terms of the area of integrated circuit consumed, and twice as fast.

Freedom in b

In general, for the following relationship there is some freedom in the choice of b because the result is rounded and hence there exists a range of solutions to the right hand side of the equation which yield the same result.

$\left\lfloor \frac{px}{q} \right\rfloor = \left\lfloor \frac{{ax} + b}{2^{k}} \right\rfloor$

Thus, bε[b_(min), b_(max)] is the range which satisfies the preceding equation.

The inventor has identified that a further optimisation of a multiply-add implementation of a multiplication by a constant fraction operation can be achieved by truncating a set of least significant binary digits Δ from the multiplication array used to perform the multiplication of x by a (see 101 in FIG. 1). This is illustrated in FIG. 4 which shows the multiplication operation 401, the addition operation 402, and shift 403. A set 405 of least significant binary digits Δ can be removed from the array without modifying the result 404 calculated by the array at the level of fixed point precision to which the multiplication by a constant fraction operation is performed. The area of integrated circuit consumed by the multiply-add implementation is consequently reduced.

The relationship between the bounds on the set Δ and the bounds of the possible range of values of b are given by the following sufficient condition:

max(Δ)−min(Δ)≦b _(max) −b _(min)

bε[b _(min)+max(Δ),b _(max)+min(Δ)]  (S_(delta))

The set of multiplier array bits in the set Δ can be chosen at design time on a trial-and-error basis with the aim of making the set Δ as large as possible and hence to remove as much as possible from the multiplier array. One way of achieving this is as follows.

-   -   1. As a first step, set Δ to be the least significant column of         bits in the multiplier array generated in accordance with the         optimal sets of parameters taught herein,     -   2. Test whether Δ satisfies the sufficient condition, S_(delta).     -   3. If Δ satisfies the sufficient condition, add the next least         significant column to the set Δ and re-perform step 2.     -   4. Iterate steps 2 and 3 until the sufficient condition no         longer holds, i.e. a multiplier array implementing the operation

$\frac{{ax} + b}{2^{k}}$

in hardware according to an optimal set of parameters a, b and k as taught herein would no longer be guaranteed to give the true rounded value of

$\frac{px}{q}$

that the operation is implemented to provide.

-   -   5. Choose the resulting set of bits for use as an initial guess         for Δ.

Often there will be some remaining freedom in b such that further bits can be removed from that column of bits of the array which caused the sufficient condition to no longer hold at step 4. In order to minimise the size of the multiplier array as far as possible, it is advantageous to at design time identify which further bits can be removed from that column of bits of the array whilst still satisfying the sufficient condition, S_(delta). This can be done using trial and error. The choice of these bits of A is arbitrary so long as the sufficient condition still holds.

Where canonical signed digit form is used in hardware, certain rows in the multiplier array are represented as negative rows in order to improve the efficiency of the hardware implementation of the desired logic operations. Typically a multiplier array configured to use canonical signed digit form adds together all of the rows of the array but performs a suitable transformation on the negative rows so as to effect the correct logical operation.

For example, a negative row can have the formula −x*2^(i). Since it is known that the array is going to sum to a positive K bit binary number (e.g. a large enough binary number such that it can store any output from the array), we can add 2^(k) to any negative row as this will not affect any of the K least significant bits, which include the output bits of the array. Thus, the above formula becomes

2k−x*2^(i)=(not(x)+1)*2^(i)

where not(x) is the logical negation of x if x were interpreted as an K−i bit number (this may involve the appending of many 0s to the front of x). When any appended 0s are logically negated they become 1s. These leading 1s are what is called signed extending x. The logical negation comes from the positive equation

not(t)+t=2^(n)−1

assuming t is an n-bit unsigned binary number.

The constant 1s as well as the constant addition of 2^(i) can be absorbed into the constant b, leaving the negative row as:

not(x)*2^(i)

where the not is applied just to the length of x.

In this manner, arithmetic negation can correspond to logical bitwise negation of x (with some adaption to the value of b).

Once a best guess for Δ has been established, the maximum and minimum values of the set Δ can be calculated as follows where canonical signed digit form is used. Each row in the multiplication array is a copy of the variable x, left-shifted by i bits where i is the position of the respective ith bit of fixed integer a having a value of +1 or −1 (since canonical signed digit form is being used in hardware). For the identified set of least significant bits Δ, we can identify all the times the bit x[0] appears, the bit x[1] appears, x[2] etc. Each bit x[j] might appear in a negative or positive row of the multiplier array.

In order to calculate a lower bound for the minimum of Δ:

-   -   where the most significant (i.e. left-most) occurrence of x[j]         appears in a negative row, we choose to set all those positions         x[j]=1;     -   where the most significant (i.e. left-most) occurrence of x[j]         appears in a positive row, we choose to set all those positions         x[j]=0.

In order to calculate an upper bound for the maximum of Δ:

-   -   where the most significant (i.e. left-most) occurrence of x[j]         appears in a negative row, we choose to set all those positions         x[j]=0;     -   where the most significant (i.e. left-most) occurrence of x[j]         appears in a positive row, we choose to set all those positions         x[j]=1.

By following this procedure at design time for all the bit positions in x which appear in delta, we obtain the minimum and maximum bounds for Δ.

The new range of b can be calculated from the maximum and minimum values of Δ using the sufficient condition S_(delta) set out above. A sensible value of b is the value in that range having the minimum Hamming weight.

Method of IC Design

The optimal solutions for a multiply-add implementation of a multiplication by a constant fraction operation which are described herein can be determined by suitable software. Typically, integrated circuits are initially designed using software (e.g. Synopsis Design Compiler) that generates a logical abstraction of the desired integrated circuit. Such an abstraction is generally termed register-transfer level or RTL. Once the logical operation of the integrated circuit has been defined, this can be used by synthesis software (e.g. Synopsis IC Compiler) to create representations of the physical integrated circuit. Such representations can be defined in high level hardware description languages, for example Verilog or VHDL and, ultimately, according to a gate-level description of the integrated circuit.

Logic for performing multiplication by a constant fraction can be readily introduced into an integrated circuit at design time. However, the design software used for designing integrated circuits will almost invariably provide the functionality using logic for performing generic division—i.e. logic for performing division by a divisor specified at runtime. Such logic is complex and consumes a significant area of integrated circuit. It is therefore preferable that, where logic for performing multiplication by a constant fraction is required, design software is configured to use logic optimised for performing multiplication by a constant fraction by means of a multiply-add operation of the form

$\frac{{ax} + b}{2^{k}}.$

The optimal solution for such an operation is described herein.

It is advantageous if software for designing an integrated circuit is configured to, on a multiplication by a constant fraction operation being specified by the designer, implement the operation in accordance with the design principles described herein. This could be by introducing into the integrated circuit design RTL defining a multiply-add operation of the form

$\frac{{ax} + b}{2^{k}}$

rather than a generic division function. The values of a, b and k can be chosen according to the optimal parameter selections described above. The software could implement multiplication by a constant fraction using a multiplier array. Preferably the software would be further configured to remove a set of Δ least significant bits from the multiplier array, as taught herein. The design of an integrated circuit can be effected according to the rules embodied in the design software at a data processing device executing the design software (such as a workstation or server).

A method of deriving a hardware representation of a binary logic circuit in accordance with the principles set out herein is illustrated in the flowchart of FIG. 7. At 701, a multiplication by a constant fraction operation

$\frac{px}{q}$

to be expressed in the efficient form

$\frac{{ax} + b}{2^{k}}$

is received. At 702, the appropriate smallest value of k is then determined from the minimum values of k that satisfy set 1 or 2 of the optimal parameter sets described above. The resulting value of k is then used at 703 to determine the appropriate values of a and b—i.e. the values of a and b from the corresponding set of the selected k are used. Once appropriate values of a, b and k have been identified, at 704 a hardware representation of a binary logic circuit in the form

$\frac{{ax} + b}{2^{k}}$

is derived in the desired format. For example, the hardware representation could be a register-transfer level (RTL) representation, a high-level circuit representations such as Verilog or VHDL, or a lower-level representations such as OASIS or GDSII. The hardware representation of the binary logic circuit can be provided (typically as part of a larger-scale chip design) for fabrication into an integrated circuit. For example, a low-level representation of an IC could be provided directly to a foundry for fabrication of the specified integrated circuit, or RTL could be provided to an intermediate chip designer who would themselves design a low-level representation of an IC from the RTL for provision to a foundry.

The method of FIG. 7 could be implemented in program code, such as RTL design software. For example, on a user of the software specifying a multiplication by a constant fraction operation, the RTL design software could be configured to implement the operation using RTL defining multiply-add logic in the form

$\frac{{ax} + b}{2^{k}},$

where a, b and k take the values described herein.

General Optimal Solution

The above-described optimal solutions for a multiply-add implementation of a multiplication by a constant fraction operation can be extended to the following more general operation.

${\left\lfloor \frac{{p*x} + r}{q} \right\rfloor = \left( {{a*x} + b} \right)}\operatorname{>>}k$

where x is in the range [A, B] and r is a positive integer.

The two sets of k, a, b which represent the optimal solutions in this more general case are as follows. These solutions can be derived by following the same steps set out above for the more limited case in which the optimal solution to

$\frac{px}{q}$

is sought and with the same constraints, but with x being in the range [A, B] and the constraint M≧2q being replaced by (B−A)≧2q.

Set 1

$\mspace{76mu} {k^{-} = {\min \left( {{k\text{:}\frac{2^{k}}{\left( {p\; 2^{k}} \right)\mspace{14mu} {mod}\mspace{14mu} q}} > {\beta_{\min}^{-} - \beta_{\max}^{-}}} \right)}}$ $\mspace{76mu} {a^{-} = \left\lfloor \frac{p\; 2^{k}}{q} \right\rfloor}$ $b^{-} \in \left\lbrack {\frac{{r\; 2^{k}} + {\beta_{\min}^{-}*\left( {p\; 2^{k}} \right)\mspace{14mu} {mod}\mspace{14mu} q}}{q},{\frac{{2^{k}\left( {r + 1} \right)} + {\beta_{\max}^{-}*\left( {p\; 2^{k}} \right)\mspace{14mu} {mod}\mspace{14mu} q}}{q} - 1}} \right\rbrack$      where      β_(max)⁻ = A + (−A − P_(q)⁻¹(r + 1))  mod  q      β_(min)⁻ = B − (B + r * P_(q)⁻¹)  mod  q

Set 2

$\mspace{76mu} {k^{+} = {\min \left( {{k\text{:}\frac{2^{k}}{\left( {{- p}\; 2^{k}} \right)\mspace{14mu} {mod}\mspace{14mu} q}} > {\beta_{\max}^{+} - \beta_{\min}^{+}}} \right)}}$ $\mspace{76mu} {a^{+} = \left\lceil \frac{p\; 2^{k}}{q} \right\rceil}$ $b^{+} \in {\left\lbrack {\frac{{r\; 2^{k}} - {\beta_{\min}^{+}*\left( {{- p}\; 2^{k}} \right)\mspace{14mu} {mod}\mspace{14mu} q}}{q},{\frac{{2^{k}\left( {r + 1} \right)} - {\beta_{\max}^{+}*\left( {{- p}\; 2^{k}} \right)\mspace{14mu} {mod}\mspace{14mu} q}}{q} - 1}} \right\rbrack \mspace{76mu} {where}}$      β_(max)⁺ = B − (B + P_(q)⁻¹(r + 1))  mod  q      β_(min)⁺ = A + (−A − r * P_(q)⁻¹)  mod  q

Again, the smallest of k⁻ and k⁺ and its associated a and b values represent the optimal solution. In the case that A is negative, x can be a signed number and the optimised multiplier array for performing the desired multiplication by a constant fraction is configured to accept and return signed numbers.

The fixed point filter of FIG. 5 and the frame processor of FIG. 6 are shown as comprising a number of functional blocks. This is schematic only and is not intended to define a strict division between different logic elements of an integrated circuit. Each functional block can be provided in any suitable manner.

The terms software and computer readable program code as used herein includes executable code for processors (e.g. CPUs and/or GPUs), firmware, bytecode, programming language code such as C or OpenCL, and modules for reconfigurable logic devices such as FPGAs. Machine-readable code includes software and code for defining hardware representations of integrated circuits at any level, including at register transfer level (RTL), at high-level circuit representations such as Verilog or VHDL, and lower-level representations such as OASIS and GDSII.

The algorithms and methods described herein could be performed by one or more physical processing units executing software that causes the unit(s) to perform the algorithms/methods. The or each physical processing unit could be any suitable processor, such as a CPU or GPU (or a core thereof), or fixed function or programmable hardware. The software could be stored in non-transitory form at a machine readable medium such as an integrated circuit memory, or optical or magnetic storage. A machine readable medium might comprise several memories, such as on-chip memories, computer working memories, and non-volatile storage devices.

The applicant hereby discloses in isolation each individual feature described herein and any combination of two or more such features, to the extent that such features or combinations are capable of being carried out based on the present specification as a whole in the light of the common general knowledge of a person skilled in the art, irrespective of whether such features or combinations of features solve any problems disclosed herein, and without limitation to the scope of the claims. The applicant indicates that aspects of the present invention may consist of any such individual feature or combination of features. In view of the foregoing description it will be evident to a person skilled in the art that various modifications may be made within the scope of the invention. 

What is claimed is:
 1. A binary logic circuit configured to determine, for an input value x, a rounded value of $\frac{{p*x} + r}{q}$ by implementing the operation $\frac{{ax} + b}{2^{k}},$ where p and q are coprime constant integers with p<q and q≠2^(i), r is a positive integer, i is an integer, and input value x is an integer variable between integers A and B where (B−A)≧2q, where a and b are predetermined fixed integers, and k is the smallest integer that satisfies either: $\begin{matrix} {{\frac{2^{k}}{\left( {p\; 2^{k}} \right)\mspace{14mu} {mod}\mspace{14mu} q} > {\beta_{\min}^{-} - \beta_{\max}^{-}}}{{where},{\beta_{\max}^{-} = {A + {\left( {{- A} - {P_{q}^{- 1}\left( {r + 1} \right)}} \right)\mspace{14mu} {mod}\mspace{14mu} q}}}}{\beta_{\min}^{-} = {B - {\left( {B + {r*P_{q}^{-}}} \right)\mspace{14mu} {mod}\mspace{14mu} q}}}{{or}\text{:}}} & (a) \\ {{\frac{2^{k}}{\left( {{- p}\; 2^{k}} \right)\mspace{14mu} {mod}\mspace{14mu} q} > {\beta_{\max}^{+} - \beta_{\min}^{+}}}{{where},{\beta_{\max}^{+} = {B - {\left( {B + {P_{q}^{- 1}\left( {r + 1} \right)}} \right)\mspace{14mu} {mod}\mspace{14mu} q}}}}{\beta_{\min}^{+} = {A + {\left( {{- A} - {r*P_{q}^{-}}} \right)\mspace{14mu} {mod}\mspace{14mu} q}}}} & (b) \end{matrix}$ wherein the binary logic circuit comprises: multiplication and addition logic having an input to receive x and configured to perform the multiplication of x by the predetermined fixed integer a and being incapable of performing multiplication of x by a variable factor, wherein the multiplication and addition logic is configured to perform the addition of b; wherein, in dependence on the values of p, q and r. if (a) is satisfied by a smaller integer k than (b), then a is predetermined to be an integer given by $\left\lfloor \frac{p\; 2^{k}}{q} \right\rfloor$ and bis predetermined to be an integer in the range $\left\lbrack {\frac{{r\; 2^{k}} + {\beta_{\min}^{-}*\left( {p\; 2^{k}} \right)\mspace{14mu} {mod}\mspace{14mu} q}}{q},{\frac{{2^{k}\left( {r + 1} \right)} + {\beta_{\max}^{-}*\left( {p\; 2^{k}} \right)\mspace{14mu} {mod}\mspace{14mu} q}}{q} - 1}} \right\rbrack;$ and if (b) is satisfied by a smaller integer k than (a), then a is predetermined to be an integer given by $\left\lceil \frac{p\; 2^{k}}{q} \right\rceil$ and b is predetermined to be an integer in the range $\left\lbrack {\frac{{r\; 2^{k}} - {\beta_{\min}^{+}*\left( {{- p}\; 2^{k}} \right)\mspace{14mu} {mod}\mspace{14mu} q}}{q},{\frac{{2^{k}\left( {r + 1} \right)} - {\beta_{\max}^{+}*\left( {p\; 2^{k}} \right)\mspace{14mu} {mod}\mspace{14mu} q}}{q} - 1}} \right\rbrack.$
 2. The binary logic circuit as set forth in claim 1, the binary logic circuit being a binary multiplier array comprising the multiplication and addition logic, the binary multiplier array having a plurality of rows, a first subset of the plurality of rows being configured to perform the multiplication by the fixed integer a, a second subset of the plurality of rows being configured to perform the addition of b, and said rounded value being the output of the multiplier array right-shifted by k binary digits.
 3. The binary logic circuit as set forth in claim 2, the first subset of the plurality of rows of the binary multiplier array being a substantially minimum number of rows required to implement the multiplication of x by fixed integer a.
 4. The binary logic circuit as set forth in claim 2, the second subset of the plurality of rows of the binary multiplier array being a single row arranged to perform the addition of fixed integer b.
 5. The binary logic circuit as set forth in claim 2, the plurality of rows of the multiplier array being arranged such that the representations of the integer variable x at those rows are collectively truncated by a set of Δ least significant digits, the set of Δ least significant digits being substantially the largest number of least significant digits that can be discarded without causing the multiplier array to deviate from the true rounded value of $\frac{{px} + r}{q}$ for any x between A and B.
 6. The binary logic circuit as set forth in claim 5, wherein the fixed integer b is the integer having the smallest Hamming weight which satisfies said operation for all x.
 7. The binary logic circuit as set forth in claim 6, wherein, in the case that (a) is satisfied by a smaller integer k than (b), if there is more than one value of b having the same smallest Hamming weight, the fixed integer b is the smallest value of b.
 8. The binary logic circuit as set forth in claim 1, wherein the multiplication and addition logic make use of a canonical signed digit representation.
 9. The binary logic circuit as set forth claim 2, wherein the multiplier array is unable to perform multiplication by a variable.
 10. The binary logic circuit as set forth in claim 1, wherein the binary logic circuit is configured to determine the rounded value of $\frac{{px} + r}{q}$ according to any one of the following rounding schemes: round towards zero (RTZ), round towards negative infinity (RTN), round towards positive infinity (RTP), and round towards nearest with ties to upper (RTU).
 11. A non-transitory machine readable storage medium having stored thereon machine readable code for generating a binary logic circuit as set forth in claim
 1. 12. A fixed point filter comprising one or more binary logic circuits configured as set forth in claim
 1. 13. A method of deriving a hardware representation of a binary logic circuit configured to determine, for an input value x, a rounded value of $\frac{{p*x} + r}{q}$ by implementing the operation $\frac{{ax} + b}{2^{k}},$ where p and q are coprime constant integers with p<q and q≠2^(i), r is a positive integer, i is an integer, input value x is an integer variable between integers A and B where (B−A)≧2q, and a, b and k are fixed integers, the method comprising: determining, in dependence on the values of p, q and r, the integer k as the smallest integer that satisfies either: $\begin{matrix} {{\frac{2^{k}}{\left( {p\; 2^{k}} \right)\mspace{14mu} {mod}\mspace{14mu} q} > {\beta_{\min}^{-} - \beta_{\max}^{-}}}{{where},{\beta_{\max}^{-} = {A + {\left( {{- A} - {P_{q}^{- 1}\left( {r + 1} \right)}} \right)\mspace{14mu} {mod}\mspace{14mu} q}}}}{\beta_{\min}^{-} = {B - {\left( {B + {r*P_{q}^{- 1}}} \right)\mspace{14mu} {mod}\mspace{14mu} q}}}{{or}\text{:}}} & (a) \\ {{\frac{2^{k}}{\left( {{- p}\; 2^{k}} \right)\mspace{14mu} {mod}\mspace{14mu} q} > {\beta_{\max}^{+} - \beta_{\min}^{+}}}{{where},{\beta_{\max}^{+} = {B - {\left( {B + {P_{q}^{- 1}\left( {r + 1} \right)}} \right)\mspace{14mu} {mod}\mspace{14mu} q}}}}{\beta_{\min}^{+} = {A + {\left( {{- A} - {r*P_{q}^{- 1}}} \right)\mspace{14mu} {mod}\mspace{14mu} q}}}} & (b) \end{matrix}$ determining fixed integers a and b such that: if (a) is satisfied by a smaller integer k than (b), calculating a as the integer given by $\left\lfloor \frac{p\; 2^{k}}{q} \right\rfloor$ and selecting b from the set of one or more integers in the range $\left\lbrack {\frac{{r\; 2^{k}} + {\beta_{\min}^{-}*\left( {p\; 2^{k}} \right)\mspace{14mu} {mod}\mspace{14mu} q}}{q},{\frac{{2^{k}\left( {r + 1} \right)} + {\beta_{\max}^{-}*\left( {p\; 2^{k}} \right)\mspace{14mu} {mod}\mspace{14mu} q}}{q} - 1}} \right\rbrack,$  and if (b) is satisfied by a smaller integer k than (a), calculating a as the integer given by $\left\lceil \frac{p\; 2^{k}}{q} \right\rceil$ and selecting b from the set of one or more integers in the range $\left\lbrack {\frac{{r\; 2^{k}} - {\beta_{\min}^{+}*\left( {{- p}\; 2^{k}} \right)\mspace{14mu} {mod}\mspace{14mu} q}}{q},{\frac{{2^{k}\left( {r + 1} \right)} - {\beta_{\max}^{+}*\left( {p\; 2^{k}} \right)\mspace{14mu} {mod}\mspace{14mu} q}}{q} - 1}} \right\rbrack;$ and deriving, using the determined fixed integers, a, b and k, a hardware representation for a binary logic circuit configured to implement the operation $\frac{{ax} + b}{2^{k}}$ by using multiplication and addition logic configured to perform multiplication of x by the fixed integer a and to perform the addition of b, wherein the multiplication and addition logic is incapable of performing multiplication of x by a variable factor.
 14. The method as set forth in claim 13, wherein deriving the hardware representation for the binary logic circuit comprises implementing said operation using a binary multiplier array comprising the multiplication and addition logic, the binary multiplier array having a plurality of rows, a first subset of the plurality of rows being configured to perform multiplication by the fixed integer a, a second subset of the plurality of rows being configured to perform the addition of b, and the rounded value being the output of the multiplier array right-shifted by k binary digits.
 15. The method as set forth in claim 14, further comprising modifying said hardware representation by truncating a set of Δ least significant digits from the plurality of rows, the set of Δ least significant digits being substantially the largest set of least significant digits that can be discarded without causing the operation implemented by the binary logic circuit to deviate from the true rounded value of $\frac{{px} + r}{q}$ for any x between A and B.
 16. The method as set forth in claim 15, wherein the fixed integer b is selected to be the integer having the smallest Hamming weight that satisfies the truncated hardware representation for the binary logic circuit.
 17. The method as set forth in claim 13, wherein the hardware representation is RTL, a hardware description language, or a gate-level description language.
 18. A non-transitory computer readable storage medium having stored thereon computer readable program code for generating a hardware representation according to the method of claim
 13. 19. A method of manufacturing an integrated circuit, the method comprising fabricating a binary logic circuit, derived according to the method as set forth in claim
 13. 20. An integrated circuit manufactured according to the method of claim
 19. 